Using Arguments for Making Decisions: A Possibilistic Logic Approach
نویسندگان
چکیده
Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various strengths. In spite of the usefulness of arguments in a decision making process, there have been few formal proposals handling this idea if we except works by Fox and Parsons and by Bonet and Geffner. In this paper we propose a possibilistic logic framework where arguments are built from an uncertain knowledge base and a set of prioritized goals. The proposed approach can compute two kinds of decisions by distinguishing between pessimistic and optimistic attitudes. When the available, maybe uncertain, knowledge is consistent, as well as the set of prioritized goals (which have to be fulfilled as far as possible), the method for evaluating decisions on the basis of arguments agrees with the possibility theory-based approach to decision-making under uncertainty. Taking advantage of its relation with formal approaches to defeasible argumentation, the proposed framework can be generalized in case of partially inconsistent knowledge, or goal bases.
منابع مشابه
New Graphical Model for Computing Optimistic Decisions in Possibility Theory Framework
This paper first proposes a new graphical model for decision making under uncertainty based on min-based possibilistic networks. A decision problem under uncertainty is described by means of two distinct min-based possibilistic Computing Optimistic Decisions 1039 networks: the first one expresses agent’s knowledge while the second one encodes agent’s preferences representing a qualitative utili...
متن کاملA Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
متن کاملevel-based Approach to Computing rranted Arguments in Possibilistic Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
متن کاملA dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملApplication of Possibilistic Stable Models to Decision Making
This paper investigates the applicability of Possibilistic Stable Models (PSM) for Logic Programming to decision making through the use of several extensions to the PSM formalism that are chosen to enhance the realism in the resulting decision making model. The selected extensions to PSMs are unified through their incorporation into an argumentation framework designed to represent the combined ...
متن کامل